Model Checking and Deduction for Innnite-state Systems
نویسنده
چکیده
Two well-known approaches to the veriication of reactive systems are deductive veriication and model checking. After brieey reviewing them, we present deductive model checking, which combines these two approaches. The new procedure uses deduction to extend the classical tableau-based model checking algorithms to the case of innnite-state systems.
منابع مشابه
Model Checking and Deduction for Verifying Innnite-state Systems
Two well-known approaches to the veriication of temporal properties of reactive systems are deductive veriication and model checking. In deductive veriication, the validity of temporal properties is reduced to rst-order veriication conditions. In model checking, the validity of the property is established by an exhaustive search of the state space for counterexamples. We review both techniques ...
متن کاملVerification by Augmented Finitary Abstraction
The paper deals with the proof method of veriication by nitary abstraction (vfa), which presents a feasible approach to the veriication of the temporal properties of (potentially innnite-state) reactive systems. The method consists of a two-step process by which, in a rst step, the system and its temporal speciica-tion are jointly abstracted into a nite-state system and a nite-state speciicatio...
متن کاملReachability checking in complex and concurrent software systems using intelligent search methods
Software system verification is an efficient technique for ensuring the correctness of a software product, especially in safety-critical systems in which a small bug may have disastrous consequences. The goal of software verification is to ensure that the product fulfills the requirements. Studies show that the cost of finding and fixing errors in design time is less than finding and fixing the...
متن کاملA Hybrid Meta-heuristic Approach to Cope with State Space Explosion in Model Checking Technique for Deadlock Freeness
Model checking is an automatic technique for software verification through which all reachable states are generated from an initial state to finding errors and desirable patterns. In the model checking approach, the behavior and structure of system should be modeled. Graph transformation system is a graphical formal modeling language to specify and model the system. However, modeling of large s...
متن کاملA short introduction to two approaches in formal verification of security protocols: model checking and theorem proving
In this paper, we shortly review two formal approaches in verification of security protocols; model checking and theorem proving. Model checking is based on studying the behavior of protocols via generating all different behaviors of a protocol and checking whether the desired goals are satisfied in all instances or not. We investigate Scyther operational semantics as n example of this...
متن کامل